On Strong Centerpoints

نویسندگان

  • Pradeesha Ashok
  • Sathish Govindarajan
چکیده

Let P be a set of n points in R and F be a family of geometric objects. We call a point x ∈ P a strong centerpoint of P w.r.t F if x is contained in all F ∈ F that contains more than cn points from P , where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations and hyperplanes in R. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centerpoints: A Link Between Optimization and Convex Geometry

We introduce a concept that generalizes several different notions of a “centerpoint” in the literature. We develop an oracle-based algorithm for convex mixed-integer optimization based on centerpoints. Further, we show that algorithms based on centerpoints are “best possible” in a certain sense. Motivated by this, we establish structural results about this concept and provide efficient algorith...

متن کامل

k-Centerpoints Conjectures for Pointsets in ℝd

In this paper, we introduce the notion of k-centerpoints for any set P of n points in Rd. These unify and generalize previous results such as the classical centerpoint theorem 1, and the recently-proven ray-shooting theorem 2. We define two variants: affine k-centerpoints, and topological k-centerpoints. We prove their equivalence in R2, and conjecture that these are in fact equivalent in any d...

متن کامل

Computing Hulls And Centerpoints In Positive Definite Space

In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a Euclidean space, are positive definite (p.d.) matrices. These applications include diffusion tensor imaging in the brain, elasticity analysis in mechanical engin...

متن کامل

Hulls And Centerpoints In Positive Definite Space ∗

In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a Euclidean space, are positive definite (p.d.) matrices. These applications include diffusion tensor imaging in the brain, elasticity analysis in mechanical engin...

متن کامل

Centerpoints and Tverberg's technique

Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg’s theorem, we show the following extension of the centerpoint theorem: given any set P of n points in the plane, and a parameter 1/3 ≤ c ≤ 1, one can always find a disk D such that any closed half-space containing D contains at least cn points of P , and furthermore, D contains at most ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 115  شماره 

صفحات  -

تاریخ انتشار 2015